Semigroups related to subshifts of graphs
نویسندگان
چکیده
We characterise in terms of Zappa-Szép products a class of semigroups which arise from actions of groupoids on semigroups constructed from subshifts of graphs.
منابع مشابه
On the Transition Semigroups of Centrally Labeled Rauzy Graphs
Rauzy graphs of subshifts are endowed with an automaton structure. For Sturmian subshifts, it is shown that its transition semigroup is the syntactic semigroup of the language recognized by the automaton. A projective limit of the partial semigroups of nonzero regular elements of their transition semigroups is described. If the subshift is minimal, then this projective limit is isomorphic, as a...
متن کاملOn the Graphs Related to Green Relations of Finite Semigroups
In this paper we develop an analog of the notion of the con- jugacy graph of nite groups for the nite semigroups by considering the Green relations of a nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a nite semigroup S , we first atte...
متن کاملA new algebraic invariant for weak equivalence of sofic subshifts
It is studied how taking the inverse image by a sliding block code affects the syntactic semigroup of a sofic subshift. Two independent approaches are used: ζ-semigroups as recognition structures for sofic subshifts, and relatively free profinite semigroups. A new algebraic invariant is obtained for weak equivalence of sofic subshifts, by determining which classes of sofic subshifts naturally d...
متن کاملA graphical difference between the inverse and regular semigroups
In this paper we investigate the Green graphs for the regular and inverse semigroups by considering the Green classes of them. And by using the properties of these semigroups, we prove that all of the five Green graphs for the inverse semigroups are isomorphic complete graphs, while this doesn't hold for the regular semigroups. In other words, we prove that in a regular se...
متن کاملPseudovarieties Defining Classes of Sofic Subshifts Closed for Taking Shift Equivalent Subshifts
For a pseudovariety V of ordered semigroups, let S (V) be the class of sofic subshifts whose syntactic semigroup lies in V. It is proved that if V contains Sl− then S (V∗D) is closed for taking shift equivalent subshifts, and conversely, if S (V) is closed for taking conjugate subshifts then V contains LSl− and S (V) = S (V∗D). Almost finite type subshifts are characterized as the irreducible e...
متن کامل